New Results on Generalized Graph Coloring
نویسندگان
چکیده
For graph classes P1, . . . ,Pk, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph G can be partitioned into subsets V1, . . . , Vk so that Vj induces a graph in the class Pj (j = 1, 2, . . . , k). If P1 = · · · = Pk is the class of edgeless graphs, then this problem coincides with the standard vertex k-colorability, which is known to be NP-complete for any k ≥ 3. Recently, this result has been generalized by showing that if all Pi’s are additive induced-hereditary, then the generalized graph coloring is NP-hard, with the only exception of bipartite graphs. Clearly, a similar result follows when all the Pi’s are co-additive. In this paper, we study the problem where we have a mixture of additive and co-additive classes, presenting several new results dealing both with NPhard and polynomial-time solvable instances of the problem.
منابع مشابه
A practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملData Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image
An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 6 شماره
صفحات -
تاریخ انتشار 2004